Exact quantum algorithms have advantage for almost all Boolean functions
نویسندگان
چکیده
منابع مشابه
Exact quantum algorithms have advantage for almost all Boolean functions
It has been proved that almost all n-bit Boolean functions have exact classical query complexity n. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all n-bit Boolean functions can be computed by an exact quantum algorithm with less than n queries. More exactly, we prove that ANDn is the only n-bit Boolean f...
متن کاملOptimal quantum query bounds for almost all Boolean functions
We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of Ambainis [1], and shows that van Dam’s oracle interrogation [9] is essentially optimal for almost all functions. Our proof uses the fact that the acceptance probability of a T -query algorithm can be written as the su...
متن کاملQuantum algorithms for testing Boolean functions
We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same...
متن کاملExact quantum query complexity for total Boolean functions
We will show that if there exists a quantum query algorithm that exactly computes some total Boolean function f by making T queries, then there is a classical deterministic algorithm A that exactly computes f making O(T ) queries. The best know bound previously was O(T ) due to Beals et al. [6].
متن کاملOmega-almost Boolean rings
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2015
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic15.5-6-5